Constructing disjoint paths for failure recovery and multipath routing

نویسندگان

  • Yong Oh Lee
  • A. L. Narasimha Reddy
چکیده

Applications such as Voice over IP and video streaming require continuous network service, requiring fast failure recovery mechanisms. Proactive failure recovery schemes have been recently proposed to improve network performance during the failure transients. These proactive failure recovery schemes need extra infrastructural support in the form of routing table entries, extra addresses etc. In this paper, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the lengths of the recovery paths close to those of the primary paths. Our evaluations show that it is possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which can be employed in multipath routing for load balancing and QoS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

متن کامل

Fast Data Collection in Multipath Routing With Independent Directed Acyclic Graphs

in this paper, we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) to achieve resilient multipath routing. The algorithm developed in this paper: (1) achieves multipath routing; (2) guarantees recovery from single link failure. The multipath routing scheme consists of an algorithm to determine a set of multiple disjoint or partially disjoint paths and a mechanism for distrib...

متن کامل

Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing

Abstract. Disjoint multipath routing (DMPR) is an effective strategy to achieve robustness in networks, where data is forwarded along multiple linkor nodedisjoint paths. DMPR poses significant challenges in terms of obtaining loopfree multiple (disjoint) paths and effectively forwarding the data over the multiple paths, the latter being particularly significant in datagram networks. One approac...

متن کامل

A multipath routing strategy to prevent flooding disruption attacks in link state routing protocols for MANETs

Multipath routing has been proposed to increase resilience against network failures or improve security in Mobile Ad-Hoc Networks (MANETs). The Optimized Link State Routing (OLSR) protocol has been adopted by several multipath routing strategies. They implement Multipoint Relay (MPRs) nodes as a flooding mechanism for distributing control information. Ideally, the construction of multiple disjo...

متن کامل

Coping with the Resilience - Congestion Tradeoff in Multipath Routing Schemes

Two major objectives of multipath routing schemes are congestion avoidance and resilience to failures. However, focusing on each objective alone severely deteriorates the quality of the other. More specifically, when multipath routing is employed for congestion avoidance, the traffic is distributed among several different paths, each potentially prone to network failures. Since any path failure...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Networks

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2012